TSTP Solution File: CSR146^3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR146^3 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:34:41 EDT 2024
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 39 ( 11 unt; 9 typ; 0 def)
% Number of atoms : 86 ( 10 equ; 0 cnn)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 217 ( 36 ~; 29 |; 9 &; 141 @)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 54 ( 20 ^ 30 !; 4 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_23,type,
husband_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_24,type,
lChris_THFTYPE_i: $i ).
thf(decl_25,type,
lCorina_THFTYPE_i: $i ).
thf(decl_26,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_27,type,
n2009_THFTYPE_i: $i ).
thf(decl_28,type,
wife_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_29,type,
inverse_THFTYPE_IIiioIIiioIoI: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(decl_30,type,
esk1_0: $i ).
thf(con,conjecture,
? [X7: $i > $i > $o] :
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( X7 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) )
& ( X7
!= ( ^ [X6: $i,X8: $i] : $true ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BPsUeW49Jy/E---3.1_27908.p',con) ).
thf(ax_002,axiom,
! [X5: $i] : ( holdsDuring_THFTYPE_IiooI @ X5 @ $true ),
file('/export/starexec/sandbox2/tmp/tmp.BPsUeW49Jy/E---3.1_27908.p',ax_002) ).
thf(ax_004,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.BPsUeW49Jy/E---3.1_27908.p',ax_004) ).
thf(ax_003,axiom,
? [X6: $i] :
~ ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ X6 ),
file('/export/starexec/sandbox2/tmp/tmp.BPsUeW49Jy/E---3.1_27908.p',ax_003) ).
thf(ax_001,axiom,
! [X1: $i > $i > $o,X2: $i > $i > $o] :
( ( inverse_THFTYPE_IIiioIIiioIoI @ X2 @ X1 )
=> ! [X3: $i,X4: $i] :
( ( X2 @ X3 @ X4 )
<=> ( X1 @ X4 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BPsUeW49Jy/E---3.1_27908.p',ax_001) ).
thf(ax,axiom,
inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
file('/export/starexec/sandbox2/tmp/tmp.BPsUeW49Jy/E---3.1_27908.p',ax) ).
thf(c_0_6,negated_conjecture,
~ ? [X7: $i > $i > $o] :
( ( ~ ( X7 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( X7 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) )
& ( X7
!= ( ^ [Z0: $i,Z1: $i] : $true ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])])])]) ).
thf(c_0_7,negated_conjecture,
! [X16: $i > $i > $o] :
( ( ~ ( X16 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ( X16 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ( X16
= ( ^ [Z0: $i,Z1: $i] : $true ) ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X16 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ( X16
= ( ^ [Z0: $i,Z1: $i] : $true ) ) )
& ( ~ ( X16 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ( X16
= ( ^ [Z0: $i,Z1: $i] : $true ) ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ( X16
= ( ^ [Z0: $i,Z1: $i] : $true ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
thf(c_0_8,plain,
! [X17: $i] : ( holdsDuring_THFTYPE_IiooI @ X17 @ $true ),
inference(variable_rename,[status(thm)],[ax_002]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1
= ( ^ [Z0: $i,Z1: $i] : $true ) )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
! [X3: $i] : ( holdsDuring_THFTYPE_IiooI @ X3 @ $true ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,axiom,
( ( ~ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_004]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1
= ( ^ [Z0: $i,Z1: $i] : $true ) )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1
= ( ^ [Z0: $i,Z1: $i] : $true ) )
| ~ ( X1 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_14,plain,
( ( ~ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i > $i > $o,X3: $i,X4: $i] :
( ( X1 @ X3 @ X4 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(arg_cong,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1
= ( ^ [Z0: $i,Z1: $i] : $true ) )
| ~ ( X1 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_10])]) ).
thf(c_0_17,plain,
( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
inference(primitive_enumeration,[status(thm)],[c_0_15]) ).
thf(c_0_19,plain,
? [X6: $i] :
~ ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ X6 ),
inference(fof_simplification,[status(thm)],[ax_003]) ).
thf(c_0_20,plain,
! [X19: $i > $i > $o,X20: $i > $i > $o,X21: $i,X22: $i] :
( ( ~ ( X20 @ X21 @ X22 )
| ( X19 @ X22 @ X21 )
| ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X20 @ X19 ) )
& ( ~ ( X19 @ X22 @ X21 )
| ( X20 @ X21 @ X22 )
| ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X20 @ X19 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_001])])])])]) ).
thf(c_0_21,negated_conjecture,
! [X4: $i,X3: $i,X1: $i > $i > $o] :
( ( X1 @ X3 @ X4 )
| ~ ( X1 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) ),
inference(arg_cong,[status(thm)],[c_0_16]) ).
thf(c_0_22,plain,
wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i,
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_23,plain,
~ ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ esk1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_19])])]) ).
thf(c_0_24,plain,
! [X4: $i,X3: $i,X2: $i > $i > $o,X1: $i > $i > $o] :
( ( X2 @ X4 @ X3 )
| ~ ( X1 @ X3 @ X4 )
| ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_25,plain,
inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
inference(split_conjunct,[status(thm)],[ax]) ).
thf(c_0_26,negated_conjecture,
! [X3: $i,X4: $i] : ( wife_THFTYPE_IiioI @ X3 @ X4 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_27,plain,
~ ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_28,plain,
! [X3: $i,X4: $i] : ( husband_THFTYPE_IiioI @ X3 @ X4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
thf(c_0_29,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : CSR146^3 : TPTP v8.1.2. Released v4.1.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n029.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 15:00:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running higher-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.BPsUeW49Jy/E---3.1_27908.p
% 0.22/0.51 # Version: 3.1.0-ho
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.22/0.51 # Starting post_as_ho4 with 300s (1) cores
% 0.22/0.51 # Starting post_as_ho2 with 300s (1) cores
% 0.22/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.51 # Starting full_lambda_10 with 300s (1) cores
% 0.22/0.51 # Starting new_ho_8 with 300s (1) cores
% 0.22/0.51 # full_lambda_10 with pid 27992 completed with status 0
% 0.22/0.51 # Result found by full_lambda_10
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.22/0.51 # Starting post_as_ho4 with 300s (1) cores
% 0.22/0.51 # Starting post_as_ho2 with 300s (1) cores
% 0.22/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.51 # Starting full_lambda_10 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
% 0.22/0.51 # Search class: HGUSF-FFSF11-SSSFFSBN
% 0.22/0.51 # partial match(1): HGUSF-FFSF21-SSSFFSBN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting post_as_ho12 with 163s (1) cores
% 0.22/0.51 # post_as_ho12 with pid 27998 completed with status 0
% 0.22/0.51 # Result found by post_as_ho12
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.22/0.51 # Starting post_as_ho4 with 300s (1) cores
% 0.22/0.51 # Starting post_as_ho2 with 300s (1) cores
% 0.22/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.51 # Starting full_lambda_10 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
% 0.22/0.51 # Search class: HGUSF-FFSF11-SSSFFSBN
% 0.22/0.51 # partial match(1): HGUSF-FFSF21-SSSFFSBN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting post_as_ho12 with 163s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 15
% 0.22/0.51 # Removed by relevancy pruning/SinE : 9
% 0.22/0.51 # Initial clauses : 11
% 0.22/0.51 # Removed in clause preprocessing : 1
% 0.22/0.51 # Initial clauses in saturation : 10
% 0.22/0.51 # Processed clauses : 33
% 0.22/0.51 # ...of these trivial : 1
% 0.22/0.51 # ...subsumed : 4
% 0.22/0.51 # ...remaining for further processing : 28
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 3
% 0.22/0.51 # Backward-rewritten : 3
% 0.22/0.51 # Generated clauses : 43
% 0.22/0.51 # ...of the previous two non-redundant : 27
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 11
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 2
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 8
% 0.22/0.51 # ...of those cached : 2
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 13
% 0.22/0.51 # Positive orientable unit clauses : 4
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 1
% 0.22/0.51 # Non-unit-clauses : 8
% 0.22/0.51 # Current number of unprocessed clauses: 11
% 0.22/0.51 # ...number of literals in the above : 25
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 15
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 13
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 11
% 0.22/0.51 # Non-unit clause-clause subsumptions : 1
% 0.22/0.51 # Unit Clause-clause subsumption calls : 11
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 5
% 0.22/0.51 # BW rewrite match successes : 3
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 1893
% 0.22/0.51 # Search garbage collected termcells : 151
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.006 s
% 0.22/0.51 # System time : 0.002 s
% 0.22/0.51 # Total time : 0.008 s
% 0.22/0.51 # Maximum resident set size: 1788 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.007 s
% 0.22/0.51 # System time : 0.004 s
% 0.22/0.51 # Total time : 0.011 s
% 0.22/0.51 # Maximum resident set size: 1724 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E exiting
%------------------------------------------------------------------------------